Advanced Analysis of Algorithms - Homework II (Solutions)
نویسنده
چکیده
1. Problem 15-2 on Page 364 of [CLRS01]. Solution: Assume that the optimal solution packs the n words in r lines; this solution can be decomposed into two parts, viz., the words packed on the first line and the words packed in the remaining (r − 1) lines. Regardless of the choice for the last word on line 1, the remaining words must be packed optimally in the lines 2 through (r − 1). (Why?) We define s[i, j] to be cost if packing words wi through wj in one line. Likewise, pij is defined as (M − j + i − ∑j t=i lt). Accordingly,
منابع مشابه
Advanced Analysis of Algorithms - Homework III (Solutions)
Solution: Yes; for instance consider the language L = {5}, i.e., the language containing a single element and the corresponding decision problem: D1: Does x ∈ L?. I can reduce an arbitrary decision problem D2 ∈ P to D1 using the reduction f , which is defined as follows: Given x as input to D2, f first checks in polynomial time, whether x ∈ D1. If x is a “yes” instance of D2, f(x) = 5; otherwis...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملBi-objective Optimization of a Multi-product multi-period Fuzzy Possibilistic Capacitated Hub Covering Problem: NSGA-II and NRGA Solutions
The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...
متن کاملOptimization of Multi-period Three-echelon Citrus Supply Chain Problem
In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the modeling of citrus supply chain more complicated than other ones. The proposed model aims to minimize network costs includin...
متن کامل